The constructive characterization of (κ,ℓ)-edge-connected digraphs
نویسندگان
چکیده
منابع مشابه
The constructive characterization of (κ, ℓ)-edge-connected digraphs
We give a constructive characterization for (k, `)-edge-connected digraphs, proving a conjecture of Frank and Szegő.
متن کاملMaximally edge-connected digraphs
In this paper we present some new sufficient conditions for equality of edge-connectivity and minimum degree of graphs and digraphs as well as of bipartite graphs and digraphs.
متن کاملSufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملHighly edge-connected detachments of graphs and digraphs
Let G = (V, E) be a graph or digraph and r : V → Z+. An r-detachment of G is a graph H obtained by ‘splitting’ each vertex v ∈ V into r(v) vertices. The vertices v1, ..., vr(v) obtained by splitting v are called the pieces of v in H. Every edge uv ∈ E corresponds to an edge of H connecting some piece of u to some piece of v. Crispin Nash-Williams [9] gave necessary and sufficient conditions for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2011
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-011-2570-2